Amalgamations of almost regular edge-colourings of simple graphs
نویسندگان
چکیده
منابع مشابه
On Almost-Regular Edge Colourings of Hypergraphs
We prove that if H = (V (H), E(H)) is a hypergraph, γ is an edge colouring of H, and S ⊆ V (H) such that any permutation of S is an automorphism of H, then there exists a permutation π of E(H) such that |π(E)| = |E| and π(E)\S = E \S for each E ∈ E(H), and such that the edge colouring γ′ of H given by γ′(E) = γ(π−1(E)) for each E ∈ E(H) is almost regular on S. The proof is short and elementary....
متن کاملVertex-distinguishing proper edge colourings of some regular graphs
The vertex-distinguishing index χs(G) of a graph G is the minimum number of colours required to properly colour the edges of G in such a way that any two vertices are incident with different sets of colours. We consider this parameter for some regular graphs. Moreover, we prove that for any graph, the value of this invariant is not changed if the colouring above is, in addition, required to be ...
متن کاملNeighbour-Distinguishing Edge Colourings of Random Regular Graphs
A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to the set of colours appearing on the edges incident with w. Let ndi(G) be the least number of colours required for a proper neighbour-distinguishing edge colouring of G. We prove that for d ≥ 4, a random d-regular grap...
متن کاملGenus distributions of graphs under edge-amalgamations
We present a general method for calculating the genus distributions of those infinite families of graphs that are obtained by iteratively amalgamating copies of some base graphs along their root-edges. We presume that the partitioned genus distributions of these base graphs are known and that their root-edges have 2-valent endpoints. We analyze and adapt the use of recombinant strands, partials...
متن کاملDistinguishing graphs by edge-colourings
We investigate the distinguishing index D′(G) of a graph G as the least number d such that G has an edge-colouring with d colours that is only preserved by the trivial automorphism. This is an analog to the notion of the distinguishing number D(G) of a graph G, which is defined for colourings of vertices. We obtain a general upper bound D′(G) ≤ ∆(G) unless G is a small cycle C3, C4 or C5. We al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1987
ISSN: 0095-8956
DOI: 10.1016/0095-8956(87)90008-6